Nonstretching NMO correction of prestack time-migrated gathers using a matching-pursuit algorithm
نویسندگان
چکیده
منابع مشابه
Automatic event picking in prestack migrated gathers using a probabilistic neural network
We describe algorithms for automating the process of picking seismic events in prestack migrated common depth image gathers. The approach uses supervised learning and statistical classification algorithms along with advanced signal/image processing algorithms. No model assumption is made such as hyperbolic moveout. We train a probabilistic neural network for voxel classification using event tim...
متن کاملprestack depth migration using CFP gathers
The common-focus-point technology CFP describes prestack migration by focusing in two steps: emission and detection. The output of the first focusing step represents a CFP gather. This gather defines a shot record that represents the subsurface response resulting from a focused source wavefield. We propose applying the recursive shot-record, depthmigration algorithm to the CFP gathers of a seis...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Automating prestack migration analysis using common focal point gathers
CFP technology (Berkhout, 1996a,b) addresses these limitations in a novel way. By breaking the model determination process into two simpler, more easily solved problems, those of operator estimation and macro model estimation, the final solution will typically be more accurate. Moreover, by providing rapid local convergence to the correct travel-time operators, migration analysis can be automat...
متن کاملA remark about orthogonal matching pursuit algorithm
In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give (p, q) instance optimality for a large class of encoders with 1 ≤ p ≤ q ≤ 2 and (p, q) 6= (2, 2). We also show that, if the encoding matrix is drawn from an appropriate distribution, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: GEOPHYSICS
سال: 2013
ISSN: 0016-8033,1942-2156
DOI: 10.1190/geo2011-0509.1